Around Logical Perfection

Regenerating Perfection.

Testing perfection is hard

A graph property P is strongly testable if for every fixed > 0 there is a one-sided -tester for P whose query complexity is bounded by a function of . In classifying the strongly testable graph properties, the first author and Shapira showed that any hereditary graph property (such as P the family of perfect graphs) is strongly testable. A property is easily testable if it is strongly testable ...

Profiling, Performance, and Perfection

A profile is “a set of data often in graphic form portraying the significant features of something”. [Web88] Profiles can help us to quickly understand a person or entity better. In the development of computer-based applications, profiles are invaluable. They help us to understand the application – how it works, how well it works, whether it in fact works as we think it does, and whether it is ...

Perfection for Pomonoids

A pomonoid S is a monoid equipped with a partial order that is compatible with the binary operation. In the same way that M -acts over a monoid M correspond to the representation of M by transformations of sets, S-posets correspond to the representation of a pomonoid S by order preserving transformations of posets. Following standard terminology from the theories of R-modules over a unital ring...

Perfection thickness of graphs

We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.